Efficient Quantum Walk on the Grid with Multiple Marked Elements
نویسندگان
چکیده
We give a quantum algorithm for finding a marked element on the grid when there are multiple marked elements. Our algorithm uses quadratically fewer steps than a random walk on the grid, ignoring logarithmic factors. This is the first known quantum walk that finds a marked element in a number of steps less than the square-root of the extended hitting time. We also give a new tighter upper bound on the extended hitting time of a marked subset, expressed in terms of the hitting times of its members.
منابع مشابه
Finding Is as Easy as Detecting for Quantum Walks
We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph. In the case when the marked set M consists of a single vertex, the number of steps of the quantum walk is quadratically smaller than the classical hitting time HT(P,M) of any reversible random walk P on the graph. In the case of multiple marked elements, the number of steps is g...
متن کاملQuantum Walks with Multiple or Moving Marked Locations
We study some properties of quantum walks on the plane. First, we discuss the behavior of quantum walks when moving marked locations are introduced. Second, we present an exceptional case, when quantum walk fails to find any of the marked locations.
متن کاملSearch by Quantum Walks on Two-Dimensional Grid without Amplitude Amplification
Abstract. We study search by quantum walk on a finite two dimensional grid. The algorithm of Ambainis, Kempe, Rivosh [AKR05] O( √ N logN) steps and finds a marked location with probability O(1/ logN) for grid of size √ N × √ N . This probability is small, thus [AKR05] needs amplitude amplification to get Θ(1) probability. The amplitude amplification adds an additional O( √ logN) factor to the n...
متن کاملQuantum Search on the Spatial Grid
Some classical solutions to problems achieve particular speed ups when we allow those algorithms to become quantum based. The most obvious result is the ability to search a group of n elements in sub linear time. Classically, it is required to look at all of the elements, one at a time, to ensure that the marked item is or is not present. In the quantum world, thanks to Lov Grover [4], we can d...
متن کاملPower Management in a Utility Connected Micro-Grid with Multiple Renewable Energy Sources
As an efficient alternative to fossil fuels, renewable energy sources have attained great attention due to their sustainable, cost-effective, and environmentally friendly characteristic. However, as a deficiency, renewable energy sources have low reliability because of their non-deterministic and stochastic generation pattern. The use of hybrid renewable generation systems along with the storag...
متن کامل